A Symplectic Algorithm for Constrained Hamiltonian Systems
نویسندگان
چکیده
In this paper, a symplectic algorithm is utilized to investigate constrained Hamiltonian systems. However, the method cannot be applied directly equations due non-canonicity. We firstly discuss canonicalization of The used constrain systems on basis canonicalization, and then numerical simulation system carried out. An example presented illustrate application results. By using systems, one can solve singular dynamic problems nonconservative mechanical nonholonomic as well physical in quantum dynamics, also available many electromechanical coupled
منابع مشابه
Symplectic Integration of Constrained Hamiltonian Systems
A Hamiltonian system in potential form (H(q, p) = p'M~ 'p/2 + E(q)) subject to smooth constraints on q can be viewed as a Hamiltonian system on a manifold, but numerical computations must be performed in R" . In this paper, methods which reduce "Hamiltonian differential-algebraic equations" to ODEs in Euclidean space are examined. The authors study the construction of canonical parametrizations...
متن کاملSymplectic Numerical Integrators in Constrained Hamiltonian Systems
Recent work reported in the literature suggests that for the long-time integration of Hamiltonian dynamical systems one should use methods that preserve the symplectic (or canonical) structure of the ow. Here we investigate the symplecticness of numerical integrators for constrained dynamics, such as occur in molecular dynamics when bond lengths are made rigid in order to overcome stepsize limi...
متن کاملSymplectic Integration of Constrained Hamiltonian Systems by Composition Methods
Recent work reported in the literature suggests that for the long-term integration of Hamiltonian dynamical systems one should use methods that preserve the symplectic structure of the ow. In this paper we investigate the symplecticity of numerical integrators for constrained Hamiltonian systems with holonomic constraints. We will derive the following two results: (i) We show that any rst or se...
متن کاملSymplectic maps for approximating polynomial Hamiltonian systems.
We study how to approximate polynomial Hamiltonian systems by composition of symplectic maps. Recently, a number of methods preserving the symplectic character have appeared. However, they are not completely satisfactory because, in general, they are computationally expensive, very difficult to obtain or their accuracy is relatively low. The efficiency of a numerical method depends on both its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11050217